Performance Evaluation of Clustering Algorithms
نویسندگان
چکیده
منابع مشابه
Performance Evaluation of Clustering Algorithms for Scalable Image Retrieval1
In this paper we present scalable algorithms for image retrieval based on color. Our solution for scalability is to cluster the images in the database into groups of images with similar color content. At search time the query image is first compared with the pre-computed clusters, and only the closest set of clusters is further examined by comparing the query image to the images in that set. Th...
متن کاملPerformance Evaluation of Some Clustering Algorithms and Validity Indices
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn’s index, Calinski-Harabasz index, and a recently developed index I . Based on a relation between the index I and the Dunn’s index, a lower bound of the value...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کاملClustering Algorithms: Study and Performance Evaluation Using Weka Tool
Data mining is the process of analyzing data from different perspectives and summarizing it into useful information. Clustering is a procedure to organizing the objects in to groups or clustered together, based on the principle of maximizing the intra-class similarity and minimizing the inter class similarity. The various clustering algorithms are analyzed and compare the performance of cluster...
متن کاملPerformance Evaluation for Clustering Algorithms in Object-Oriented Database Systems
It is widely acknowledged that good object clustering is critical to the performance of object-oriented databases. However, object clustering always involves some kind of overhead for the system. The aim of this paper is to propose a modelling methodology in order to evaluate the performances of different clustering policies. This methodology has been used to compare the performances of three c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Science and Information Technology
سال: 2013
ISSN: 2320-8457,2320-7442
DOI: 10.5121/ijcsity.2013.14087